Description: 经典的货郎担问题解决办法，采用了模拟退火算法，结构非常清楚，速度很快！-classic traveling salesman problem solution, using simulated annealing, the structure is very clear, very fast! Platform: |
Size: 1437696 |
Author:红红 |
Hits:
Description: 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the existing one salesman must traveled n this city, and visit each city only once, finally starting to return to the city, for the shortest distance from the genetic algorithm. Platform: |
Size: 1024 |
Author:阳文 |
Hits:
Description: 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the other readme.txt. (Example format for the ACS, see myprojects catalogs, including eil51, d198. lin318 other small-scale, and from 1000 to 3000 among cities example, can be the optimal solution) Platform: |
Size: 445440 |
Author:caqi |
Hits:
Description: 旅行商问题：
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. Platform: |
Size: 56320 |
Author:章为到 |
Hits:
Description: 这是一个用遗传算法来求解旅行商问题（TSP问题：Travelling Salesman Problem）的源代码，学习遗传算法，演化计算的很值得一看！-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic algorithm, evolutionary computation is very worth a visit! Platform: |
Size: 71680 |
Author:郭肇禄 |
Hits:
Description: Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases. Platform: |
Size: 446464 |
Author:yangdi |
Hits:
Description: 遗传算法和“货郎担” 问题:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point." -Genetic algorithm and the Platform: |
Size: 283648 |
Author:s050403054 |
Hits:
Description: 使用MPI编写一个并行程序，利用遗传算法来解决旅行商问题。-The use of MPI to prepare a parallel process, the use of genetic algorithm to solve the traveling salesman problem. Platform: |
Size: 53248 |
Author:pim |
Hits:
Description: 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes. Platform: |
Size: 2048 |
Author:zhoulitc |
Hits:
Description: have recently become very interested in the area of genetic algorithms and Ant Colony Optimization techniques. I was determined to write a complete program demonstrating these two techniques. In particular I wanted to compare the efficiency of these two approaches in the area of finding solutions to the Traveling Salesman Problem Platform: |
Size: 99328 |
Author:nasser |
Hits:
Description: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。-TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], which said dij city i to city j the distance, i, j = 1, 2 ... n, the problem is to identify each city exactly once visited a loop and make it to the shortest path length. Platform: |
Size: 268288 |
Author:章为到 |
Hits:
Description: matlab多旅行商问题以及各种算法如蚂蚁算法和遗传算法-matlab multi-traveling salesman problem and various algorithms such as the ant algorithm and genetic algorithm Platform: |
Size: 4096 |
Author:sunyongnan |
Hits:
Description: 这是一篇关于多旅行商问题的学术论文，非常有新意，非常有利于我们深入了解mtsp问题的本质-This is a multi-traveling salesman problem on the papers, very fresh, very beneficial to our in-depth understanding of the nature of the problem mtsp Platform: |
Size: 49152 |
Author:王斌 |
Hits:
Description: 用MATLAB求解遗传算法的旅行商问题，这一类问题在大学生以及研究生的数模竞赛以及日常生活当中尤为重要的，为我们所重视。、近年来，学术界对旅行商问题也逐渐重视起来。-Using MATLAB genetic algorithm for solving the traveling salesman problem, this kind of problem students and graduate students in Mathematical Modeling Contest, and daily life is particularly important for our attention. In recent years, the academic community on the traveling salesman problem is gradually pay attention to it. Platform: |
Size: 6144 |
Author:zhangshenglin |
Hits:
Search - traveling salesman problem